Dynamic Katz and related network measures

We study walk-based centrality measures for time-ordered network sequences. For the case of standard dynamic walk-counting, we show how to derive and compute induced by analytic functions. also prove that Katz centrality, based on resolvent function, has unique advantage allowing computations be performed entirely at node level. then consider two distinct types backtracking develop a framework capturing walk combinatorics when either or both is disallowed.